Generation of lower bounds for minimum span frequency assignment
نویسندگان
چکیده
منابع مشابه
Lower bounds for Minimum Interference Frequency Assignment Problems
In this paper we describe a new lower bound procedure for the minimum interference frequency assignment problem (MI-FAP). In the MI-FAP we have to assign frequencies to transmitter-receiver pairs in such a way that the cumulative interference in the communication network is minimized. Mainly due to the fairly large number of available frequencies, exact methods fail to solve the more di cult in...
متن کاملMinimum Span Frequency Assignment Based on a Multiagent Evolutionary Algorithm
In frequency assignment problems (FAPs), separation of the frequencies assigned to the transmitters is necessary to avoid the interference. However, unnecessary separation causes an excess requirement of spectrum, the cost of which may be very high. Since FAPs are closely related to T-coloring problems (TCP), multiagent systems and evolutionary algorithms are combined to form a new algorithm fo...
متن کاملSuperpolynomial Lower Bounds for Monotone Span Programs
In this paper we obtain the first superpolynomial lower bounds for monotone span programs computing explicit functions. The best previous lower bound was Ω(n) by Beimel, Gál, Paterson [BGP]; our proof exploits a general combinatorial lower bound criterion from that paper. Our lower bounds are based on an analysis of Paley-type bipartite graphs via Weil’s character sum estimates. We prove an n n...
متن کاملA Study of Permutation Operators for Minimum Span Frequency Assignment Using an Order Based Representation
The genetic algorithm (GA) described in this paper breeds permutations of transmitters for minimum span frequency assignment. The approach hybridizes a GA with a greedy algorithm, and employs a technique called Generalized Saturation Degree to seed the initial population. Several permutation operators from the GA literature are compared, and results indicate that position based operators are mo...
متن کاملA New Genetic Algorithm for Minimum Span Frequency Assignment using Permutation and Clique
We propose a new Genetic Algorithm (GA) for solving the minimum span frequency assignment problem (MSFAP). The MSFAP is minimizing the range of the frequencies assigned to each transmitter in a region satisfying a number of constraints. The proposed method involves finding and ordering of the transmitters for use in a greedy (sequential) assignment process, and it also utilizes graph theoretic ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2002
ISSN: 0166-218X
DOI: 10.1016/s0166-218x(01)00265-7